Scribe : Wesley Botham Paper : Constraint Models for the Covering Test Problem

Presenter: Pingyu Zhang Scribe: Wesley Botham Paper: Constraint Models for the Covering Test Problem Authors: Brahim Hnich, Steven D. Prestwich, Evgeny Selensky, Barbara M. Smith, Constraints 2006 The speaker stated that the paper 1. Addresses the covering test problem, an optimization problem. 2. Models & solves the problem as a CSP and as a SAT, and 3. Discusses the performance of the approaches adopted WRT existing systems on benchmark problems. Regarding the CP approach, the paper 1. Describes three models for representing the covering test problem as a CSP 2. Discusses methods for reducing the search space by symmetry breaking 3. Summarizes results of experiments in solving the associated CSPs Regarding the SAT approach, the paper 1. Describes a method for modeling the covering test problem as a SAT problem 2. Summarizes results of experiments in solving the associated SAT problem